Optimasi Fungsi Multimodal Menggunakan Flower Pollination Algorithm Dengan Teknik Clustering
نویسندگان
چکیده
منابع مشابه
Multidimensi Pada Data Warehouse Dengan Menggunakan Rumus Kombinasi
Multidimensional in data warehouse is a compulsion and become the most important for information delivery, without multidimensional data warehouse is incomplete. Multidimensional give the able to analyze business measurement in many different ways. Multidimensional is also synonymous with online analytical processing (OLAP).
متن کاملValidasi data dengan menggunakan objek lookup pada borland delphi 7.0
s: Developing an application with some tables must concern the validation of input (scpecially in Table Child). In order to maximize the accuracy and input data validation. Its called lookup (took data from other dataset). There are 2 (two) ways to lookup data from Table Parent: 1) Using Objects (DBLookupComboBox & DBLookupListBox), or 2) Arranging The Properties Of Fields Data Type (shown by u...
متن کاملFlower Pollination Algorithm for Global Optimization
Flower pollination is an intriguing process in the natural world. Its evolutionary characteristics can be used to design new optimization algorithms. In this paper, we propose a new algorithm, namely, flower pollination algorithm, inspired by the pollination process of flowers. We first use ten test functions to validate the new algorithm, and compare its performance with genetic algorithms and...
متن کاملNovel Clustering Based Routing Approach in Manet by Flower Pollination Algorithm
In this thesis, the extra burden of the nodes that are within the neighbourhood of the base station in a cluster-based network has been modelled as extra virtual member nodes. We virtually divide the network into regions according to the proximity to the BS denoting the closest region as the front region and the farthest region as the rear region. The nodes have been classified according to the...
متن کاملHybrid data clustering approach using K-Means and Flower Pollination Algorithm
Data clustering is a technique for clustering set of objects into known number of groups. Several approaches are widely applied to data clustering so that objects within the clusters are similar and objects in different clusters are far away from each other. K-Means, is one of the familiar center based clustering algorithms since implementation is very easy and fast convergence. However, K-Mean...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Techno.Com
سال: 2020
ISSN: 2356-2579,2356-2579
DOI: 10.33633/tc.v19i2.3216